The Israeli Queue with Priorities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Israeli Queue with Priorities

We consider a 2-class, single-server, preemptive priority queueing model in which the high-priority customers form a classical M/M/1 queue, while the low-priority customers form the so-called Israeli Queue with at most N different groups and unlimited-size batch service. We provide an extensive probabilistic analysis and calculate key performance measures. Special cases are analyzed and numeric...

متن کامل

The Israeli queue with retrials

The so-called “Israeli queue” (Boxma et al. in Stoch Model 24(4):604– 625, 2008; Perel and Yechiali in Probab Eng Inf Sci, 2013; Perel and Yechiali in Stoch Model 29(3):353–379, 2013) is a multi-queue polling-type system with a single server. Service is given in batches, where the batch sizes are unlimited and the service time of a batch does not depend on its size. After completing service, th...

متن کامل

A finite buffer queue with priorities

We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...

متن کامل

The Israeli Queue with Infinite Number of Groups

The so called “Israeli Queue” is a single server polling system with batch service of an unlimited size, where the next queue to be visited is the one in which the first customer in line has been waiting for the longest time. The case with finite number of queues (groups) was introduced by Boxma, Van der Wal and Yechiali [3]. In this paper we extend the model to the case with a (possibly) infin...

متن کامل

The Israeli Queue with Finite and Infinite Number of Families

The so called ”Israeli Queue” is a single server polling system with batch service of an unlimited size, where the next queue to be visited is the one having the most senior waiting customer. The case with finite number of queues (families) was introduced in Boxma, Wal and Yechiali [2]. In this paper we extend the model to the case with a (possibly) infinite number of families. We analyze the M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Models

سال: 2013

ISSN: 1532-6349,1532-4214

DOI: 10.1080/15326349.2013.808911